Block preconditioning and domain decomposition methods. II
نویسندگان
چکیده
منابع مشابه
Preconditioning for radial basis functions with domain decomposition methods
In our previous work, an effective preconditioning scheme that is based upon constructing least-squares approximation cardinal basis functions (ACBFs) from linear combinations of the RBF-PDE matrix elements has shown very attractive numerical results. The preconditioner costs O(N2) flops to set up and O(N) storage. The preconditioning technique is sufficiently general that it can be applied to ...
متن کاملWavelet Stabilization and Preconditioning for Domain Decomposition
The aim of this paper is to propose a stabilization technique in order to circumvent the two inf{sup conditions needed for stability of the discretization of the Three Fields Formulation for domain decomposition methods BM93, BM94]. Realization of this technique in terms of wavelets is presented. Furthermore, the resulting discrete problem is shown to admit an asymptotically optimal preconditio...
متن کاملPreconditioning for Domain Decomposition through Function Approximation
A new approach was presented in [11] for construcling preconditioners through a function approximation for the domain decomposi~ion-basedpreconditioned conjugate gradient method. This work extends the approach to more general cases where grids may be nonuniform; elliptic operatoI'B may have variable coefficients (but are separable and self-adjoint); and geometric domains may be nonrectangular. ...
متن کاملDomain Decomposition Preconditioning for Parallel PDE Software
Domain decomposition methods have been applied to the solution of engineering problems for many years. Over the past two decades however the growth in the use of parallel computing platforms has ensured that interest in these methods, which offer the possibility of parallelism in a very natural manner, has become greater than ever. This interest has led to research that has yielded significant ...
متن کاملOverlapping Domain Decomposition Methods
Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1988
ISSN: 0377-0427
DOI: 10.1016/0377-0427(88)90343-3